Signed Hellinger measure for directional association
نویسندگان
چکیده
منابع مشابه
A novel fuzzy measure and its extensional signed fuzzy measure
When there are interactions among the independent variables, the performances of the most often used multiple regression models and ridge regression model are not well enough. In contrast, the Choquet integral takes into account the interactions among independent variables, the discrete Choquet integral regression models based on some non-negative valued fuzzy measures or monotonic measure can ...
متن کاملDirectional Convexity Measure for Binary Tomography
Beküldte Németh Gábor 2. k, 2014-07-22 14:55 Tasi T [1], Nyúl LG [2], Balázs P [3]. Directional Convexity Measure for Binary Tomography [4]. In: Sanniti di Baja G [5], Ruiz-Shulcloper J [6], editors. Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Berlin; Heidelberg: Springer Verlag; 2013. 9. p. 9-16p. Doktori iskola elfogadás: igen Válogatott publikáció: ige...
متن کاملHahn Decomposition Theorem of Signed Lattice Measure
In this paper, we will define a signed Lattice measure on σ-algebras, as well as give the definition of positive and negative Lattice. Herein, we will show that the Hahn Decomposition Theorem decomposes any space X into a positive lattice A and a negative Lattice B such that A∨B =X and the signed Lattice measure of A ∧ B is 0.
متن کاملThe directional hybrid measure of efficiency in data envelopment analysis
The efficiency measurement is a subject of great interest. The majority of studies on DEA models have been carried out using radial or non-radial approaches regarding the application of DEA for the efficiency measurement. This paper, based on the directional distance function, proposes a new generalized hybrid measure of efficiency under generalized returns to scale with the existence of both r...
متن کاملHellinger distance
In this lecture, we will introduce a new notion of distance between probability distributions called Hellinger distance. Using some of the nice properties of this distance, we will generalize the fooling set argument for deterministic protocols to the randomized setting. We will then use this to prove a Ω(n) lower bound for the communication complexity of Disjointness. We will also see how this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Data and Information Science Society
سال: 2016
ISSN: 1598-9402
DOI: 10.7465/jkdi.2016.27.2.353